Systems of quasi-equilibrium problems with lower and upper bounds
نویسندگان
چکیده
In this work, we consider systems of quasi-equilibrium problems with lower and upper bounds and establish the existence of their solutions by using some known maximal element theorems for a family of multivalued maps. Our problems are more general than the one posed in [G. Isac, V.M. Sehgal, S.P. Singh, An alternative version of a variational inequality, Indian J. Math. 41 (1999) 25–31]. As a particular case, we also get the answer to the problem raised in [G. Isac, V.M. Sehgal, S.P. Singh, An alternative version of a variational inequality, Indian J. Math. 41 (1999) 25–31]. c © 2006 Elsevier Ltd. All rights reserved.
منابع مشابه
Solving the Single Machine Problem with Quadratic Earliness and Tardiness Penalties
Nowadays, scheduling problems have a considerable application in production and service systems. In this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. In many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combin...
متن کاملOn a generalized vector equilibrium problem with bounds
(1) x0 ∈ K such that c1 ≤ f(x0, y) ≤ c2, for all y ∈ K, where K is a given set, f : K × K → R is a given function and c1 and c2 two real numbers such that c1 ≤ c2. If K is a nonempty closed subset in a locally convex semi-reflexive topological vector space, then the problem (1) is problem by Isac, Sehgal and Singh [16] (Open Problem 2). In [20], Li gave the answer of this problem by introducing...
متن کاملEstimating Upper and Lower Bounds For Industry Efficiency With Unknown Technology
With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...
متن کاملRelating Semantic and Proof-Theoretic Concepts for Polynominal Time Decidability of Uniform Word Problems
Introduction 2 • PTIME decidable uniform word problems for quasi-varieties • CS applications: type inference systems, program analysis, decision procedures in ATP • fundamental effective methods for establishing PTIME upper bounds • local theories (Givan, McAllester 92) capture PTIME • algebraic criteria by Skolem (1920), Evans (1951), and Burris (1995) • relation between these criteria Introdu...
متن کاملUpper and lower bounds of symmetric division deg index
Symmetric Division Deg index is one of the 148 discrete Adriatic indices that showed good predictive properties on the testing sets provided by International Academy of Mathematical Chemistry. Symmetric Division Deg index is defined by $$ SDD(G) = sumE left( frac{min{d_u,d_v}}{max{d_u,d_v}} + frac{max{d_u,d_v}}{min{d_u,d_v}} right), $$ where $d_i$ is the degree of vertex $i$ in graph $G$. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Math. Lett.
دوره 20 شماره
صفحات -
تاریخ انتشار 2007